The largest singletons of set partitions
نویسندگان
چکیده
منابع مشابه
The largest singletons in weighted set partitions and its applications
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملSingletons and adjacencies of set partitions of type B
We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zero-block, in analogy with the result of Callan for ordinary partitions.
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملSet Partitions in R
This short paper introduces a code snippet in the form of an R function that enumerates all possible partitions of a finite set given the sizes of the equivalence classes. Three combinatorial problems are solved using the software: one from bioinformatics, one from scheduling theory, and one from forensic science.
متن کاملRecords in Set Partitions
A partition of [n] = {1, 2, . . . , n} is a decomposition of [n] into nonempty subsets called blocks. We will make use of the canonical representation of a partition as a word over a finite alphabet, known as a restricted growth function. An element ai in such a word π is a strong (weak) record if ai > aj (ai > aj) for all j = 1, 2, . . . , i−1. Furthermore, the position of this record is i. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2011
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2010.10.011